Chapter 10 BDI Logics
نویسنده
چکیده
This paper presents an overview of so-called BDI logics, logics where the notion of Beliefs, Desires and Intentions play a central role. Starting out from the basic ideas about BDI by Bratman, we consider various formalizations in logic, such as the approach of Cohen and Levesque, slightly remodelled in dynamic logic, Rao & Georgeff’s influential BDI logic based on the branching-time temporal logic CTL⇤, the KARO framework and BDI logic based on STIT (seeing to it that) logics.
منابع مشابه
A review of “ Reasoning About Rational Agents ”
Reasoning About Rational Agents is concerned with developing practical reasoning (as contrasted with theoretical reasoning) for rational computer agents within the “Belief, Desire, Intention” model. The BDI model for computer agents is based on the theory of rational action in humans put forward in 1988 by the philosopher M. Bratman in his book Intention, Plans and Practical Reason. BDI logics ...
متن کاملLogics for Intelligent Agents and Multi-Agent Systems
This chapter presents the history of the application of logic in a quite popular paradigm in contemporary computer science and artificial intelligence, viz. the area of intelligent agents and multi-agent systems. In particular we discuss the logics that have been used to specify single agents, the so-called BDI logics, modal logics that describe the beliefs, desires and intentions of agents, af...
متن کاملBDI Logics
This paper presents an overview of so-called BDI logics. Starting out from the basic ideas about BDI by Bratman, we consider various formalizations in logic, such as the approach of Cohen and Levesque, slightly remodelled in dynamic logic, Rao & Georgeff’s influential BDI logic based on the branching-time temporal logic CTL*, the KARO framework and BDI logic based on stit (seeing to it that) lo...
متن کاملComplexity of multiagent BDI logics with restricted modal context
We present and discuss a novel language restriction for modal logics for multiagent systems that can reduce the complexity of the satisfiability problem from EXPTIME-hard to NPTIME-complete. In the discussion we focus on a particular BDI logic, called TeamLog, which is a logic for modelling cooperating groups of agents and which possesses some of the characteristics typical to other BDI logics....
متن کاملOn Constructing Fibred Tableaux for BDI Logics
In [11,13] we showed how to combine propositional BDI logics using Gabbay’s fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based decision procedure for the combined/fibred logics. We show how to uniformly construct a tableau calculus for the combined logic using Governatori’s labelled tableau system KEM.
متن کامل